Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks

In this work we investigate and compare bounds on throughput and delay performance of code-based scheduling protocols derived from the codewords of Reed-Solomon and Hermitian codes. It is found that Hermitian codes outperform Reed-Solomon codes in minimum throughput guarantee and delay metrics when the number of nodes is in the order of thousands. The relative minimum distance of a code is identified as a crucial parameter for a code to achieve better minimum guaranteed performance. Furthermore, the terminology of error control coding is used to present a more general and constructive frame-work for the study of code-based scheduling protocols.